The “global” convergence of Broyden-like methods with suitable line search
نویسندگان
چکیده
منابع مشابه
Global Convergence of Conjugate Gradient Methods without Line Search
Global convergence results are derived for well-known conjugate gradient methods in which the line search step is replaced by a step whose length is determined by a formula. The results include the following cases: 1. The Fletcher-Reeves method, the Hestenes-Stiefel method, and the Dai-Yuan method applied to a strongly convex LC objective function; 2. The Polak-Ribière method and the Conjugate ...
متن کاملOn the Global Convergence of Broyden ' s Method
We consider Broyden's 1965 method for solving nonlinear equations. If the mapping is linear, then a simple modification of this method guarantees global and Qsuperlinear convergence. For nonlinear mappings it is shown that the hybrid strategy for nonlinear equations due to Powell leads to R-superlinear convergence provided the search directions form a uniformly linearly independent sequence. We...
متن کاملConvergence of Line Search A-Function Methods
Recently, the Line Search A-Function (LSAF) was introduced as a technique that generalizes Extended Baum-Welch (EBW) algorithm for functions of continuous probability densities. It was shown that LSAF provides a unified scheme for a large class of optimization problems that involve discriminant objective functions of different probability densities or sparse representation objective functions s...
متن کاملGlobal convergence analysis of line search interior point methods for nonlinear programming without regularity assumptions∗
It has been noticed by Wächter and Biegler that a number of interior point methods for nonlinear programming based on line search strategy may generate a sequence converging to an infeasible point. We show that by adopting a suitable merit function, a modified primal-dual equation, and a proper line search procedure, a class of interior point methods of line search type will generate a sequence...
متن کاملGlobal and Local Convergence of Line Search Filter Methods for Nonlinear Programming
Line search methods for nonlinear programming using Fletcher and Leyffer’s filter method, which replaces the traditional merit function, are proposed and their global and local convergence properties are analyzed. Previous theoretical work on filter methods has considered trust region algorithms and only the question of global convergence. The presented framework is applied to barrier interior ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of the Australian Mathematical Society. Series B. Applied Mathematics
سال: 1986
ISSN: 0334-2700,1839-4078
DOI: 10.1017/s0334270000005208